Dithering by Differences of Convex Functions

Dithering by Differences of Convex Functions

Motivated by a recent halftoning method which is based on electrostatic principles, we analyse a halftoning framework where one minimizes a functional consisting of the difference of two convex functions (DC). One of them describes attracting forces caused by the image gray values, the other one enforces repulsion between points. In one dimension, the minimizers of our functional can be compute...

Singular values of convex functions of matrices

‎Let $A_{i},B_{i},X_{i},i=1,dots,m,$ be $n$-by-$n$ matrices such that $‎sum_{i=1}^{m}leftvert A_{i}rightvert ^{2}$ and $‎sum_{i=1}^{m}leftvert B_{i}rightvert ^{2}$  are nonzero matrices and each $X_{i}$ is‎ ‎positive semidefinite‎. ‎It is shown that if $f$ is a nonnegative increasing ‎convex function on $left[ 0,infty right) $ satisfying $fleft( 0right)‎ ‎=0 $‎, ‎then  $$‎2s_{j}left( fleft( fra...

Subordination by convex functions

Subordination by Convex Functions

Let K(α), 0≤α< 1, denote the class of functions g(z)= z+∑∞n=2anzn which are regular and univalently convex of order α in the unit disc U . Pursuing the problem initiated by Robinson in the present paper, among other things, we prove that if f is regular in U , f(0) = 0, and f(z)+zf ′(z) < g(z)+zg′(z) in U , then (i) f(z) < g(z) at least in |z| < r0, r0 = √ 5/3 = 0.745 . . . if f ∈ K; and (ii) f...

Refined optimality conditions for differences of convex functions

We provide a necessary and sufficient condition for strict local minimisers of differences of convex (DC) functions, as well as related results pertaining to characterisation of (non-strict) local minimisers, and uniqueness of global minimisers.